Resource-Constrained Multi-Project Reactive Scheduling Problem with New Project Arrival

Reactive project scheduling is an important branch of under uncertainty. This paper proposes a resource-constrained multi-project reactive problem (RCMPRSP) with new arrival to minimize the adjustment cost baseline schedule while achieving deterministic goal. Although RCMPRSP aims cost, it adds constraint ensure that one schedules shortest possible make-span after arrival. Therefore, and can both be optimized during when must scheduled due this has two stages. In first stage, obtained by fully rescheduling second rescheduled The exact solution implemented on IBM ILOG CPLEX Optimization Studio. results computational experiments demonstrate proposed method distinct advantages over existing methods.